package LeetCode.month01.day18;

public class No62 {
    public static void main(String[] args) {
        System.out.println(uniquePaths(3,3));
    }
    public static int uniquePaths(int m, int n) {
        int[][]dp = new int[m][n];
        dp[0][0]=0;
        for (int i = 0; i < m; i++) {
            dp[i][0]=1;
        }
        for (int i = 0; i < n; i++) {
            dp[0][i]=1;
        }
        for (int i = 1; i < m; i++) {
            for (int j = 1; j < n; j++) {
                dp[i][j] = dp[i][j-1]+dp[i-1][j];
            }
        }
        return dp[m-1][n-1];
    }
}
